Description: 著名的加密算法md5的通用算法，并有单次算法和多次算法的直接演算-famous encryption algorithm md5 generic algorithms, and algorithm for single and multiple direct routing algorithm Platform: |
Size: 27537 |
Author:李权 |
Hits:
Description: It provides multiple routing (DHT) algorithms such as Chord, Kademlia, Koorde, Pastry and Tapestry, and a distributed environment emu -It provides multiple routing (DHT) algori thms such as Chord, Kademlia, Koorde. Pastry and Tapestry. and a distributed environment emu Platform: |
Size: 211281 |
Author:古月 |
Hits:
Description: 这个程序是用遗传算法解决车辆路径问题的．程序完整，完美．-the procedure is using genetic algorithms to solve vehicle routing problem. The integrity of the process and perfect. Platform: |
Size: 11606 |
Author:王二 |
Hits:
Description: 一个p2p Streaming的原型系统，基于树状结构的应用层组播开发。完整的寻径和平衡树算法。-a prototype system, based on the tree structure of the application layer multicast development. Integrity of the routing and balanced tree algorithms. Platform: |
Size: 2117958 |
Author:JimmyW |
Hits:
Description: 计算机网络实验上的建立路由表的程序，这个程序使用到了DJSKLA算法！-Experiments on the computer network routing table to establish the procedures, which use algorithms to DJSKLA! Platform: |
Size: 261120 |
Author:黄其 |
Hits:
Description: 实现这个算法需要如下的信息，首先算法要有己形成的多播路由树T 到所有目的节点的最短路信息，为此算法采用一个树组TD 记录已形成的多播路由树到每一个目的节点的最短路消息-The realization of this algorithm needs the following information, first of all algorithms have been formed by multicast routing tree T for all purposes to the most short-circuit node information, for this algorithm uses a tree TD record group has formed a multicast routing tree to each purpose node of the most short-circuit the news Platform: |
Size: 7168 |
Author:rock |
Hits:
Description: 做了一大堆J2EE WEB应用之后，闲来无事决定研究一下桌面应用程序开发。
想了一下干脆做个Java版的星际，研究的对象就是星际的JS山寨版－JS星际。
看了几下,当机立断决定山寨之。。。。
后来经过无数个夜晚的煎熬终于完成了一部分，特来和大家分享一下。
暂时支持采矿，攻击，寻路，局域网对战.
虽然只能算一个Demo，但是用到了很多Java基础技术和算法:
Java2D,双缓冲,A星寻路，粒子系统，动画效果，处理图片，Swing ui ,UDP,TCP/Socket.
另外这个程序也可以看出jre1.5和jre1.6之前的性能差别。-Done after a lot of J2EE WEB application,闲来无事decided to look into the development of desktop applications.
想了一下simply to be a Java version of the Star, the object of study is the interplanetary version of the JS cottage-JS Star.
Read a few, decided to make a prompt decision on the cottage. . . .
After countless nights of suffering has finally completed part and special to share with you.
Temporary support for mining, attacks, routing, LAN war.
Although the operator can only be a Demo, but use a lot of Java technology and algorithms based on:
Java2D, double buffering, A Star Search Road, particle systems, animation, image processing, Swing ui, UDP, TCP/Socket.
In addition this procedure can be seen jre1.5 and the performance difference before jre1.6. Platform: |
Size: 1500160 |
Author:lll |
Hits:
Description: he paper investigates some important transport
layer algorithms for wireless sensor networks.adopt multi-path routing on the network layer
and distributed TCP caching on the transport layer to
enhance transport reliability. Platform: |
Size: 195584 |
Author:amir rastegar |
Hits:
Description: 模拟一台路由器使用距离向量算法更新路由表功能-Simulate a router using distance-vector algorithms update the routing table function Platform: |
Size: 2048 |
Author:chongzi |
Hits:
Description: GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally.-GA_Traffic
The Traveling Salesman Problem (TSP) is maybe the archetypical problem
in combinatorial optimization. This problem and its generalizations, vehicle
routing problems, have been studied for more than thirty years two entire
monographs are devoted to the subject [34, 26]. Since the TSP is NP-hard,
polynomial-time approximation algorithms are usually studied. However,
usually the approaches to the study of vehicle routing problems adopt an
offline point of view: the input is entirely known beforehand. In many
applications, this is actually not the case since the instance becomes known
in an online fashion, time after time. Even determining when the instance
is completely given could be impossible. The need for an online model then
arises naturally. Platform: |
Size: 1024 |
Author:gardenia_roses |
Hits:
Description: 路由仿真软件的设计与实现（距离-向量算法）仿真软件是指专门用于仿真的计算机软件。它与仿真硬件同为仿真的技术工具。仿真软件是从50年代中期开始发展起来的。它的发展与仿真应用、算法、计算机和建模等技术的发展相辅相成。其目标是不断改善面向问题、面向用户的模块描述能力和对模型实验的功能。-Routing Simulation Software Design and Implementation (distance- vector algorithms) simulation software is devoted to the simulation of computer software. It is the same as the hardware emulation and simulation technology tools. Simulation software development from the mid-50s up. Its development and simulation applications, algorithms, computer and modeling the development of complementary technologies. The goal is to continue to improve problem-oriented, user-oriented description of the module capabilities and features of the model experiments. Platform: |
Size: 1913856 |
Author:潘凌昀 |
Hits:
Description: 实现网络中的RIP协议，包含水平分裂算法。可以帮助进一步掌握计算机网络中的核心技术——路由技术。-RIP protocol to achieve the network, including the level of splitting algorithms. Can help to master the core technology of computer network- routing. Platform: |
Size: 2048 |
Author:dsy |
Hits:
Description: 在谈判阻塞算法在电路设计中的应用，该算法不断迭代直到不存在被使用一次以上的路由资源。在每一次迭代过程中，先删除每个线网，然后根据最小化成本函数的原则重新布线-Choking algorithm in the negotiations in the circuit design, the iterative algorithms have been used until there is no more than one routing resources. In each iteration, delete every line network, and then minimize the cost function according to the principle of re-wiring Platform: |
Size: 70656 |
Author:hello |
Hits:
Description: Kademlia协议（以下简称Kad）是美国纽约大学的PetarP. Maymounkov和David Mazieres.
在2002年发布的一项研究结果《Kademlia: A peerto -peer information system based on the XOR metric》。
简单的说，Kad 是一种分布式哈希表（DHT）技术，不过和其他 DHT 实现技术比较，如 Chord、CAN、Pastry 等，Kad 通过独特的以异或算法（XOR）为距离度量基础，建立了一种 全新的 DHT 拓扑结构，相比于其他算法，大大提高了路由查询速度。-Kademlia Agreement (Kad) is a New York University' s PetarP. Maymounkov and David Mazieres. In 2002, a study released " Kademlia: A peerto-peer information system based on the XOR metric" . Simply put, Kad is a distributed hash table (DHT) technology, but compared with other DHT implementation technologies, such as Chord, CAN, Pastry, etc., Kad through a unique algorithm to different or (XOR) as a distance measure based on DHT established a new topology, compared to other algorithms, which greatly improves the speed of routing queries. Platform: |
Size: 221184 |
Author:MeterCai |
Hits:
Search - routing algorithms